Element (mathematics)

In mathematics, an element or member of a set is any one of the distinct objects that make up that set.

Contents 1 Sets 2 Notation and terminology 3 Cardinality of sets 4 Examples 5 References

Sets

Writing A = {1, 2, 3, 4 },means that the elements of the set A are the numbers 1, 2, 3 and 4. Sets of elements of A, for example {1, 2}, are subsets of A.

Sets can themselves be elements. For example consider the set B = {1, 2, {3, 4}}. The elements of B are not 1, 2, 3, and 4. Rather, there are only three elements of B, namely the numbers 1 and 2, and the set {3, 4}.

The elements of a set can be anything. For example, C = { red, green, blue }, is the set whose elements are the colors red, green and blue.

Notation and terminology

The relation "is an element of", also called set membership, is denoted by ∈. Writing

means that "x is an element of A". Equivalent expressions are "x is a member of A", "x belongs to A", " is in A" and "x lies in A". The expressions "A includes x" and "A contains x" are also used to mean set membership, however some authors use them to mean instead "x is a subset of A".^[1] Logician George Boolos strongly urged that "contains" be used for membership only and "includes" for the subset relation only.^[2]

The LaTeX command for this symbol is "\in".

The negation of set membership is denoted by ∉.

Cardinality of sets

The number of elements in a particular set is a property known as cardinality, informally this is the size of a set. In the above examples the cardinality of the set A is 4, while the cardinality of either of the sets B and C is 3. An infinite set is a set with an infinite number of elements, while a finite set is a set with a finite number of elements. The above examples are examples of finite sets. An example of an infinite set is the set of natural numbers, N = { 1, 2, 3, 4, ... }.

Examples

Using the sets defined above:

• 2 ∈ A
• {3,4} ∈ B
• {3,4} is a member of B
• Yellow ∉ C
• The cardinality of D = { 2, 4,  8, 10, 12 } is finite and equal to 5.
• The cardinality of P = { 2, 3, 5, 7, 11, 13, ...} (the prime numbers) is infinite (this was proven by Euclid).

References

Logic   Overview Academic areas Argumentation theory Axiology Critical thinking Computability theory Formal semantics History of logic Informal logic Logic in computer science Mathematical logic Mathematics Metalogic Metamathematics Model theory Philosophical logic Philosophy Philosophy of logic Philosophy of mathematics Proof theory Set theory Foundational concepts Abduction Analytic truth Antinomy A priori Deduction Definition Description Entailment Induction Inference Logical consequence Logical form Logical implication Logical truth Name Necessity Meaning Paradox Possible world Presupposition Probability Reason Reasoning Reference Semantics Statement Strict implication Substitution Syntax Truth Truth value Validity   Philosophical logic Critical thinking and Informal logic Analysis Ambiguity Argument Belief Bias Credibility Evidence Explanation Explanatory power Fact Fallacy Inquiry Opinion Parsimony Premise Propaganda Prudence Reasoning Relevance Rhetoric Rigor Vagueness Theories of deduction Constructivism Dialetheism Fictionalism Finitism Formalism Intuitionism Logical atomism Logicism Nominalism Platonic realism Pragmatism Realism   Metalogic and metamathematics Cantor's theorem Church's theorem Church's thesis Consistency Effective method Foundations of mathematics Gödel's completeness theorem Gödel's incompleteness theorems Soundness Completeness Decidability Interpretation Löwenheim–Skolem theorem Metatheorem Satisfiability Independence Type–token distinction Use–mention distinction   Mathematical logic General Formal language Formation rule Formal system Deductive system Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Natural deduction Rule of inference Relation Theorem Logical consequence Axiomatic system Type theory Symbol Syntax Theory Traditional logic Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram Propositional calculus and Boolean logic Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables Predicate First-order Quantifiers Predicate Second-order Monadic predicate calculus Set theory Set Empty set Enumeration Extensionality Finite set Function Subset Power set Countable set Recursive set Domain Range Ordered pair Uncountable set Model theory Model Interpretation Non-standard model Finite model theory Truth value Validity Proof theory Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax Computability theory Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function   Non-classical logic Modal logic Alethic Axiologic Deontic Doxastic Epistemic Temporal Intuitionism Intuitionistic logic Constructive analysis Heyting arithmetic Intuitionistic type theory Constructive set theory Fuzzy logic Degree of truth Fuzzy rule Fuzzy set Fuzzy finite element Fuzzy set operations Substructural logic Structural rule Relevance logic Linear logic Paraconsistent logic Dialetheism Description logic Ontology Ontology language   Logicians Anderson Aristotle Averroes Avicenna Bain Barwise Bernays Boole Boolos Cantor Carnap Church Chrysippus Curry De Morgan Frege Geach Gentzen Gödel Hilbert Kleene Kripke Leibniz Löwenheim Peano Peirce Putnam Quine Russell Schröder Scotus Skolem Smullyan Tarski Turing Whitehead William of Ockham Wittgenstein Zermelo   Lists Topics Outline of logic Index of logic articles Mathematical logic Boolean algebra Set theory Other Logicians Rules of inference Paradoxes Fallacies Logic symbols Portal Category Outline WikiProject Talk changes